Quantum Principles and Mathematical Computability
نویسندگان
چکیده
منابع مشابه
Quantum Principles and Mathematical Computability
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then outline a quantum mechanical “algorithm” for one of the insoluble problems of mathematics, the Hilbert’s tenth and equivalently the Turing halting problem. The key...
متن کاملQuantum Computability
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum polynomial time (BQP) introduced by Bernstein and Vazirani [Proc. 25th ACM Symposium on Theory of Computat...
متن کاملComputability of Banach Space Principles
We investigate the computable content of certain theorems which are sometimes called the “principles” of the theory of Banach spaces. Among these the main theorems are the Open Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also study closely related theorems, as Banach’s Inverse Mapping Theorem, the Theorem on Condensation of Singularities and the BanachStein...
متن کاملWeihrauch Degrees, Omniscience Principles and Weak Computability
In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice with the disjoint union of multi-valued functions as greatest ...
متن کاملComputability in Basic Quantum Mechanics
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H. In terms of the Hilbert lattice L of closed linear subspaces of L the notions of state and observable can be formulated as kind of measures as in [20]. The aim of this paper is to show that there is a good notion of computability for these data structures in the sense of Weihrauch’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Theoretical Physics
سال: 2005
ISSN: 0020-7748,1572-9575
DOI: 10.1007/s10773-005-7070-y